Hybrid fault tolerant routing algorithm in NoC
نویسندگان
چکیده
منابع مشابه
CAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
متن کاملA Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP) concept. Past research has revealed that Preplanned Backup Protection method and the Path Restoration scheme can provide a best compromise on the reserved spare capacity and the failure restoration time. Base on a set...
متن کاملA Stochastic Fault-tolerant Routing Algorithm in Hyper-star Graphs
A hyper-star graph HS(2n, n) is promising as a generic topology for interconnection networks of parallel processing systems because it has merits of a hypercube and a star graph. This paper proposes an O(n log n) algorithm that constructs a faultfree path between a pair of non-faulty nodes in HS(2n, n) with faulty nodes. For each node and each distance, the algorithm first calculates an estimat...
متن کاملFault Tolerant Method to Improving Quality of Service of Be Slack Time Routing in Noc Systems
The network on chip (NoC) architectures is being proposed for implementing a routing performance on the systems for real-time multi-media applications. The Guaranteed throughput (GT) and best effort (BE) traffic on main working concept on this system. GT traffic not only lead to under-utilization of communication links and routers, but also leads to degradation of QoS parameters for BE traffic....
متن کاملFault-tolerant Routing in Metacube
A new interconnection network with low-degree for very large parallel computers called metacube (MC) has been introduced recently. The MC network has short diameter similar to that of the hypercube. However, the degree of an MC network is much lower than that of a hypercube of the same size. More than one hundred of millions of nodes can be connected by an MC network with up to 6 links per node...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Perspectives in Science
سال: 2016
ISSN: 2213-0209
DOI: 10.1016/j.pisc.2016.06.028